arXiv:1107.1052v1 [cs.DS] 6 JulThe traveling salesman problem on cubic and subcubic graphs∗ Sylvia Boyd†

Source URL: arxiv.org

• Matching
• Eulerian path
• Petersen graph
• Travelling salesman problem
• Graph
• Tree
• Chordal graph
• Hamiltonian path
• Planar graph
• Graph theory
• NP-complete problems
• Cubic graph

Mohoworksheet disc word6 The scale of the graph above may change during down loading and photocopying. The large squares on the graph paper should be 2cm. Complete this table station

Source URL: www.earth-science-activities.co.uk

A Local-Search 2-Approximation for 2-Correlation-Clustering? Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in

Source URL: tom.thesnail.org

• NP-complete problems
• Matroid theory
• Spanning tree
• Signed graph
• Clique
• Graph
• Tree
• Eulerian path
• Pseudoforest
• Graph theory
• Theoretical computer science
• Mathematics

Flexible Graph Partitioning of Power Grids with Peer-to-peer Electricity Exchange Kazuhiro Minami, Tomoya Tanjo, Nana Arizumi, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {kminami, tanjo, a

Source URL: systemsresilience.org

• Network flow
• NP-complete problems
• Graph partition
• Graph operations
• Maximum flow problem
• Topology
• Flow network
• Connectivity
• Planar separator theorem
• Graph theory
• Theoretical computer science
• Mathematics

Compactness-Preserving Mapping on Trees Jan Baumbach, Jiong Guo, Rashid Ibragimov Network Alignment Comparison of networks/graphs

Source URL: www.cs.ucr.edu

• Graph theory
• Complexity classes
• NP
• Graph isomorphism
• NP-complete problems
• Theoretical computer science
• Computational complexity theory
• Mathematics

SOS Lecture 2: Max Cut, Sparsest Cut, Small Set Expansion and some relations of Isoperimetry and Hypercontractivity / Boaz Barak Lecture notes by Adrian Vladu and Henry Yuen Suggested reading • As I mentioned in the em

Source URL: www.boazbarak.org

• Combinatorial optimization
• Degree
• Cut
• NP-complete problems
• Combinatorics
• Randomized algorithm
• Euclidean algorithm
• Mathematics
• Graph theory
• Theoretical computer science

Practical Partition-Based Theorem Proving for Large Knowledge Bases Sheila McIlraith Bill MacCartney Knowledge Systems Lab Knowledge Systems Lab Computer Science Dept. Computer Science Dept. Stanford University

Source URL: www.ksl.stanford.edu

• Automated theorem proving
• Combinatorics
• NP-complete problems
• Graph partition
• Resolution
• Partition
• Tree decomposition
• First-order logic
• Mathematics
• Graph theory
• Theoretical computer science

Job Cost Percent Complete Graph (Estimate vs. Cumulative Costs) - Detail eDeneb 3.0 Your Company:34PM

Source URL: www.denebsoftware.com

Effective Caching Techniques for Accelerating Pattern Matching Queries Arash Fard, Satya Manda, Lakshmish Ramaswamy, and John A. Miller Computer Science Department The University of Georgia Athens, GA, USA

Source URL: cobweb.cs.uga.edu

• NP-complete problems
• Tree
• Subgraph isomorphism problem
• Graph
• Vertex
• Neighbourhood
• Matching
• Graph operations
• Line graph
• Graph theory
• Mathematics
• Theoretical computer science

From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/klei

Source URL: www.cs.cornell.edu

• Network theory
• Sociology
• Nature
• Complex systems theory
• Social information processing
• Social network
• Complex system
• Graph theory
• Internet
• Networks
• Science
• Structure